On the Generalized Spectral Characterizations of Eulerian Graphs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Developments on spectral characterizations of graphs

In [E.R. van Dam and W.H. Haemers, Which graphs are determined by their spectrum?, Linear Algebra Appl. 373 (2003), 241-272] we gave a survey of answers to the question of which graphs are determined by the spectrum of some matrix associated to the graph. In particular, the usual adjacency matrix and the Laplacian matrix were addressed. Furthermore, we formulated some research questions on the ...

متن کامل

Spectral characterizations of sandglass graphs

The sandglass graph is obtained by appending a triangle to each pendant vertex of a path. It is proved that sandglass graphs are determined by their adjacency spectra as well as their Laplacian spectra. © 2009 Elsevier Ltd. All rights reserved.

متن کامل

Spectral Characterizations of Dumbbell Graphs

A dumbbell graph, denoted by Da,b,c, is a bicyclic graph consisting of two vertexdisjoint cycles Ca, Cb and a path Pc+3 (c > −1) joining them having only its end-vertices in common with the two cycles. In this paper, we study the spectral characterization w.r.t. the adjacency spectrum of Da,b,0 (without cycles C4) with gcd(a, b) > 3, and we complete the research started in [J.F. Wang et al., A ...

متن کامل

Ela Spectral Characterizations of Propeller Graphs

Received by the editors on April 17, 2012. Accepted for publication on December 15, 2013. Handling Editor: Xingzhi Zhan. Department of Mathematics and Statistics, The University of Melbourne, Parkville, VIC 3010, Australia ([email protected], [email protected]). Electronic Journal of Linear Algebra ISSN 1081-3810 A publication of the International Linear Algebra Society Vol...

متن کامل

Spectral Characterizations of Some Distance-Regular Graphs

When can one see from the spectrum of a graph whether it is distance-regular or not? We give some new results for when this is the case. As a consequence we find (among others) that the following distance-regular graphs are uniquely determined by their spectrum: The collinearity graphs of the generalized octagons of order (2, 1), (3, 1) and (4, 1), the Biggs-Smith graph, the M22 graph, and the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Electronic Journal of Combinatorics

سال: 2019

ISSN: 1077-8926

DOI: 10.37236/8257